A convex metric for a locally connected continuum

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Convex Metric for a Locally Connected Continuum

A subset M of a topological space 5 is said to have a convex metric (even though S may have no metric) if the subspace M of 5 has a convex metric. It is known [5 J that a compact continuum is locally connected if it has a convex metric. The question has been raised [5] as to whether or not a compact locally connected continuum M can be assigned a convex metric. Menger showed [5] that M is conve...

متن کامل

Every Monotone Open 2-homogeneous Metric Continuum Is Locally Connected

In [16, Theorem 3.12, p. 397], Ungar answered a question of Burgess [2] by showing that every 2-homogeneous metric continuum is locally connected. A short, elementary and elegant proof of this result has been given by Whittington [17] who has omitted a powerful result of Effros (viz. Theorem 2.1 of [4, p. 39]) used by Ungar. It is observed in this note that Whittington's proof can be applied to...

متن کامل

A locally connected continuum without convergent sequences

We answer a question of Juhász by constructing under CH an example of a locally connected continuum without nontrivial convergent sequences.  2002 Elsevier Science B.V. All rights reserved.

متن کامل

Egoroff Theorem for Operator-Valued Measures in Locally Convex Cones

In this paper, we define the almost uniform convergence and the almost everywhere convergence for cone-valued functions with respect to an operator valued measure. We prove the Egoroff theorem for Pvalued functions and operator valued measure θ : R → L(P, Q), where R is a σ-ring of subsets of X≠ ∅, (P, V) is a quasi-full locally convex cone and (Q, W) is a locally ...

متن کامل

A Proximity Metric for Continuum Path Planning

The problem of planning motions of robot manipulators and similar mechanical devices in the presence of obstacles is one of keen interest to the artificial intelligence community. Most of the algorithms previously reported for solving such problems have been combinatorial algorithms, which work by partitioning the problem domain continuum into a finite set of equivalence classes, and applying c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1949

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1949-09298-4